Robust domain-adaptive discriminant analysis
نویسندگان
چکیده
Consider a domain-adaptive supervised learning setting, where classifier learns from labeled data in source domain and unlabeled target to predict the corresponding labels. If classifier’s assumption on relationship between domains (e.g. covariate shift, common subspace, etc.) is valid, then it will usually outperform non-adaptive classifier. its invalid, can perform substantially worse. Validating assumptions relationships not possible without We argue that, order make classifiers more practical, necessary focus robustness; robust sense that an adaptive still at least as well having rely validity of strong assumptions. With this objective mind, we derive conservative parameter estimation technique, which transductive Vapnik Chervonenkis, show for discriminant analysis new estimator guaranteed achieve lower risk given samples compared Experiments problems with geographical sampling bias indicate our performs well.
منابع مشابه
Robust Fisher Discriminant Analysis
Fisher linear discriminant analysis (LDA) can be sensitive to the problem data. Robust Fisher LDA can systematically alleviate the sensitivity problem by explicitly incorporating a model of data uncertainty in a classification problem and optimizing for the worst-case scenario under this model. The main contribution of this paper is show that with general convex uncertainty models on the proble...
متن کاملRobust Discriminant Analysis
Daar de proefschriften in de reeks van de Faculteit Economische en Toegepaste Economische Wetenschappen het persoonlijk werk zijn van hun auteurs, zijn alleen deze laatsten daarvoor verantwoordelijk. i Acknowledgements " De laatste loodjes wegen het zwaarst " is surely an appropriate Dutch expression, regarding the work of the last few months. My years of research were great as well as very tou...
متن کاملLocality Adaptive Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular technique for supervised dimensionality reduction, and its performance is satisfying when dealing with Gaussian distributed data. However, the neglect of local data structure makes LDA inapplicable to many real-world situations. So some works focus on the discriminant analysis between neighbor points, which can be easily affected by the noise in t...
متن کاملFast and robust discriminant analysis
The goal of discriminant analysis is to obtain rules that describe the separation between groups of observations. Moreover it allows to classify new observations into one of the known groups. In the classical approach discriminant rules are often based on the empirical mean and covariance matrix of the data, or of parts of the data. But because these estimates are highly influenced by outlying ...
متن کاملRobust Kernel Fisher Discriminant Analysis
Kernel methods have become standard tools for solving classification and regression problems in statistics. An example of a kernel based classification method is Kernel Fisher discriminant analysis (KFDA), a kernel based extension of linear discriminant analysis (LDA), which was proposed by Mika et al. (1999). As in the case of LDA, the classification performance of KFDA deteriorates in the pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2021
ISSN: ['1872-7344', '0167-8655']
DOI: https://doi.org/10.1016/j.patrec.2021.05.005